Published 2001

Topics
algorithms, algorithm design

In this course design and analysis of algorithms is studied. Methodologies

include: divide and conquer, dynamic programming, and greedy

strategies. Their applications involve: sorting, ordering and

searching, graph algorithms, geometric algorithms, mathematical

(number theory, algebra and linear algebra) algorithms, and string

matching algorithms.

We study algorithm analysis - worst case, average case, and amortized,

with an emphasis on the close connection between the time complexity

of an algorithm and the underlying data structures. We study

NP-Completeness and methods of coping with intractability. Techniques

such as approximation and probabilistic algorithms are studied for

handling the NP-Complete problems.

Text: Introduction to Algorithms, Cormen, Rivest, Leiserson.

Reference: Computers and Intractability, Garey and Johnson

Requirements: Two exams, six problem sets.

include: divide and conquer, dynamic programming, and greedy

strategies. Their applications involve: sorting, ordering and

searching, graph algorithms, geometric algorithms, mathematical

(number theory, algebra and linear algebra) algorithms, and string

matching algorithms.

We study algorithm analysis - worst case, average case, and amortized,

with an emphasis on the close connection between the time complexity

of an algorithm and the underlying data structures. We study

NP-Completeness and methods of coping with intractability. Techniques

such as approximation and probabilistic algorithms are studied for

handling the NP-Complete problems.

Text: Introduction to Algorithms, Cormen, Rivest, Leiserson.

Reference: Computers and Intractability, Garey and Johnson

Requirements: Two exams, six problem sets.

Audio/Visual sound, color

Simply Excellent Excellent Excellent and Reminded me of the college days :)

Love the material. The professor does a helluva job explaining a complex topic in a way that can be readily understood.

BTW, the 02-20-01 and 02-27-01 lecture are corrupted. Do good versions of the file exist anywhere?

BTW, the 02-20-01 and 02-27-01 lecture are corrupted. Do good versions of the file exist anywhere?

I'm moroccan, our acadimic language is normaly French, but i swear i found this pretty good explained and well done, even better than any Prof of ours could do.

Thanx a lot for this videos :)

Thanx a lot for this videos :)

Thank You !

Very Good Lecture ...

Very Good Lecture ...

Can't believe this is free! I didn't even have to go to my classes. These lectures covered more than my class. I breeze through my class with a great grade.

Prof. Shai is excellent........really excellent..

THank you very much.

THank you very much.

Prof. Shai Simonson is the best lecturer I've ever heard in my life. And he makes AAD very easy. Read the text book after listening to this lecture, and you'll understand almost everything.

Good quality lectures, excellent teaching.

Good quality lectures, excellent teaching.

MICROSOFT OFFICE DOCUMENT
BACK

29.0K

Syllabus (MS Word)
175.5K

Lecture 1: Notes (MS Word)
124.0K

Exercises, Day 1 (MS Word)
109.5K

Exercises, Day 3 (MS Word)
104.5K

Exercises, Day 4 (MS Word)
258.5K

Exercises, Day 5 (MS Word)
219.5K

Exercises, Day 6 (MS Word)
52.0K

Convex Hull (MS Word)
38.0K

Problem Set 1 (MS Word)
38.5K

Problem Set 2 (MS Word)
45.0K

Problem Set 3 (MS Word)
58.0K

Probelm Set: 4 (MS Word)
39.5K

Problem Set 5 (MS Word)
38.5K

Problem Set 6 (MS Word)
MPEG4
BACK

514.6M

Lecture 1 (Real player)
558.6M

Lecture 2 (Real player)
499.2M

Lecture 3 (Real player)
503.3M

Lecture 4 (Real player)
539.1M

Lecture 5 (Real player)
532.4M

Lecture 6 (Real player)
471.4M

Lecture 7 (Real player)
547.6M

Lecture 8 (Real player)
559.4M

Lecture 9 (Real player)
472.5M

Lecture 10 (Real player)
517.6M

Lecture 11 (Real player)
487.5M

Lecture 12 (Real player)
513.7M

Lecture 13 (Real player)
400.9M

Lecture 14 (Real player)
479.5M

Lecture 15 (Real player)
481.4M

Lecture 16 (Real player)
464.6M

Lecture 17 (Real player)
526.2M

Lecture 18 (Real player)
506.0M

Lecture 19 (Real player)
473.4M

Lecture 20 (Real player)
PDF
BACK

7.3K

Syllabus (PDF)
84.5K

Lecture 1: Notes (PDF)
30.3K

Lecture 1: Notes (PDF)
7.1K

Problem Set 1 (PDF)
5.2K

Problem Set 2 (PDF)
15.6K

Problem Set 3 (PDF)
14.1K

Problem Set 4 (PDF)
6.3K

Problem Set 5 (PDF)
5.1K

Problem Set 6 (PDF)
In Collection

ArsDigita Computer Science University